Transportation-Cost Inequalities on Path Space over Manifolds with Boundary
نویسندگان
چکیده
Let L = ∆ + Z for a C vector field Z on a complete Riemannian manifold possibly with a boundary. A number of transportation-cost inequalities on the path space for the (reflecting) L-diffusion process are proved to be equivalent to the curvature condition Ric−∇Z ≥ −K and the convexity of the boundary (if exists). These inequalities are new even for manifolds without boundary, and are partly extended to non-convex manifolds by using a conformal change of metric which makes the boundary from non-convex to convex. 2010 Mathematics Subject Classification: 60J60, 58G60.
منابع مشابه
0 A ug 2 00 9 Transportation - Cost Inequalities on Path Space Over Manifolds with Boundary ∗
Let L = ∆+Z for a C1 vector field Z on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) L-diffusion process are proved to be equivalent to the curvature condition Ric−∇Z ≥ −K and the convexity of the boundary (if exists). These inequalities are new even for manifolds withou...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملIsoperimetric-type inequalities on constant curvature manifolds
By exploiting optimal transport theory on Riemannian manifolds and adapting Gromov’s proof of the isoperimetric inequality in the Euclidean space, we prove an isoperimetric-type inequality on simply connected constant curvature manifolds.
متن کاملFixed-Charge Transportation on a Path: Linear Programming Formulations
The fixed-charge transportation problem is a fixed-charge network flow problem on a bipartite graph. This problem appears as a subproblem in many hard transportation problems, and is also both a special case and a strong relaxation of the challenging bigbucket multi-item lot-sizing problem. In this paper, we provide a polyhedral analysis of the polynomially solvable special case in which the as...
متن کاملOn Holomorphic Factorization in Asymptotically AdS 3D Gravity
This paper studies aspects of “holography” for Euclidean signature pure gravity on asymptotically AdS 3-manifolds. This theory can be described as SL(2,C) CS theory. However, not all configurations of CS theory correspond to asymptotically AdS 3-manifolds. We show that configurations that do have the metric interpretation are parameterized by the so-called projective structures on the boundary....
متن کامل